Combining Breadth-First and Depth-First Strategies in Searching for Treewidth
نویسندگان
چکیده
Breadth-first and depth-first search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combines the complementary strengths of both. We show the benefits of this approach using the treewidth problem as an example.
منابع مشابه
Searching for Spanning k-Caterpillars and k-Trees
We consider the problems of finding spanning k-caterpillars and k-trees in graphs. We first show that the problem of whether a graph has a spanning kcaterpillar is NP-complete, for all k ≥ 1. Then we give a linear time algorithm for finding a spanning 1-caterpillar in a graph with treewidth k. Also, as a generalized versions of the depth-first search and the breadth-first search algorithms, we ...
متن کاملA appraisal paper on Breadth-first search, Depth-first search and Red black tree
Breadth-first and depth-first search are indispensable adventure strategies leading which many other rummage around algorithms are built. In this dissertation, we projected an loomed of integrating these two strategies in a solitary algorithm that combines the corresponding strengths of mutual. We account preliminary computational outcome using the tree width predicament as an example. This dis...
متن کاملClassical search strategies for test case generation with Constraint Logic Programming
Test case generation for concurrent reactive systems on the grounds of symbolic execution basically amounts to searching their state space. As in the case of model checkers, different search strategies (depth-first, breadth-first, best-first, tabu) together with different strategies for storing visited states have a significant impact on the performance of the generation algorithm. We present e...
متن کاملStrategies for Adding Control Information to Declarative Grammars
Strategies are proposed for combining different kinds of constraints in declarative grammars with a detachable layer of control information. The added control information is the basis for parametrized dynamically controlled linguistic deduction, a form of linguistic processing that permits the implementation of plausible linguistic performance models without giving up the declarative formulatio...
متن کاملSimple vertex ordering characterizations for graph search
Graph searching is fundamental. Many graph algorithms employ some mechanism for systematically visiting all vertices and edges of a given graph. After choosing some initial sequence of vertices, it is natural to choose as the next vertex to visit some vertex that is adjacent to a previously visited vertex whenever possible. This statement describes graph search in its most general setting. When...
متن کامل